The benefits of search costs in multiagent exploration
نویسندگان
چکیده
Humans and software agents alike spend considerable time and effort in searching. Search enables finding the things that better fit and agent’s goals. But search can also be a costly process. Search costs can either come in the form of direct monetary payments, or in the form of time and resources spent. In general, the searcher must balance between the benefits provided by longer and broader search, on the one hand, and the associated increased cost, on the other. In economic literature search costs are often referred to as “environment friction” or “market inefficiency” and associated with reduced market performance [1]. Indeed, in the presence of search costs a rational player will not aim to find the best option, but rather settle for the “good enough”, beyond which the marginal cost of searching exceeds the marginal benefit of continuing the search. Thus, search costs promote sub-optimal results (or so it would seem). As such, the traditional wisdom is that when designing a MAS environment, search costs should be avoided or reduced to a minimum. Taking eCommerce as an example, most researchers see a great benefit in the ability of eMarketplaces to lower the buyers’ cost to obtain information (e.g. about the price features) from multiple sellers, as well as the sellers’ reduced costs to communicate their information [1]. The lowered search cost is associated in this case with increased economic efficiency and enable new markets to emerge. Similarly, many systems have been introduced in which central mechanisms or mediators are used in order to supply the agents complete information concerning market opportunities, eliminating the need to engage in costly search. In this paper we show that, not withstanding the above, search costs – “friction”, if and when applied appropriately,
منابع مشابه
Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملThe Relationship Between the Scope of Essential Health Benefits and Statutory Financing: An International Comparison Across Eight European Countries
Background Both rising healthcare costs and the global financial crisis have fueled a search for policy tools in order to avoid unsustainable future financing of essential health benefits. The scope of essential health benefits (the range of services covered) and depth of coverage (the proportion of costs of the covered benefits that is covered publicly) are corresponding variables in determini...
متن کاملAugmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملکسب و کار الکترونیکی در حوزه سلامت
Background and Aim: The use of electronic operations in health care industry has many positive points such as health care quality improvement, reduction in costs, and increased efficiency. Besides talking about the concept of Mobile Commerce (M-Commerce) as well as its benefits and challenges, the present article presents suitable approaches to benefit more from this new technology in the field...
متن کاملSYMBIOTIC ORGANISMS SEARCH AND HARMONY SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION OF STRUCTURES
In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012